PaMiraXT: Parallel SAT Solving with Threads and Message Passing
نویسندگان
چکیده
This article describes PaMiraXT, a powerful parallel SAT algorithm. PaMiraXT follows a master/client model based on message passing, making it suitable for any kind of workstation cluster. For the clients, MiraXT is used, which itself is thread-based parallel solver designed to take advantage of current and future shared memory multiprocessor systems. We highlight design and implementation details that allow the threads/clients to run and cooperate efficiently. Experimental results show that MiraXT compares well to other state-of-the-art SAT algorithms. In single-threaded mode, it outperforms MiniSat2, PicoSAT 535, and RSat 2.01, while in multi-threaded mode, MiraXT provides cutting edge performance, as it solves significantly more instances within the given time limit. A case study, using three copies of MiraXT with a total of 8 threads as clients, underlines the potential of PaMiraXT, resulting in a speedup of 5.62 on the industrial benchmarks of the 2007 SAT competition.
منابع مشابه
A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملDistributed Sequential Computing
Sequential computations can benefit from distributed computing through the use of self-migrating threads. On large problems, significant performance improvement is achieved by eliminating disk paging completely, trading off against a modest amount of data communication. The key idea is to have computation and small-sized data move to meet with large-sized data rather than the other way around. ...
متن کاملGeneralized Communicators in the Message Passing Interface
We propose extensions to the Message Passing Interface (MPI) that generalize the MPI communicator concept to allow multiple communication endpoints per process, dynamic creation of endpoints, and the transfer of endpoints between processes. The generalized communicator construct can be used to express a wide range of interesting communication structures, including collective communication opera...
متن کاملParallel Homologous Search with Hirschberg Algorithm: A Hybrid MPI-Pthreads Solution
In this paper, we apply two different parallel programming model, the message passing model using Message Passing Interface (MPI) and the multithreaded model using Pthreads, to protein sequence homologous search. The protein sequence homologous search uses Hirschberg algorithm for the pair-wise sequence alignment. The performance of the homologous search using the MPI-Pthread is compared to the...
متن کاملA parallel portfolio SAT solver with lockless physical clause sharing
Since multi–core architectures have become well–established the enquiry for parallel SAT solvers has drastically increased. Meanwhile, several successful SAT solvers have been presented that can be run in parallel mode. However, there are only a few solvers that use the shared memory architectures for physical clause sharing. In this paper we present a parallel SAT solver that allows for sharin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JSAT
دوره 6 شماره
صفحات -
تاریخ انتشار 2009